Penyelesaian Vehicle Routing Problem with TIME Windows (VRPTW) Dengan Modified Differential Evolution Algorithm

摘要

This studydiscusses modification ofthe DifferentialEvolutionalgorithmto solve theVehicleRoutingProblem withTimeWindows(VRPTW). Algorithmdevelopmentis done byadding theinitialsolutiongeneratingtechnique. First initials solution generationtechniqueis use arandomfunction, then based onnearestneighbordistance (minimum distance). The next initials solution generationtechniqueis use solomon insertion. These resultsconfirmthat thedevelopment of algorithmscapable findingsolutionsthatdothe samewith thebestknownsolutions fromthe data usedasdata test, eitherthe number ofvehicles usedorthe resultingdistance. Modifieddifferentialevolutionalgorithmis able to workcompetitivelyin the solomon data test C105, C106, C107, C108 andC109with gapvalueof 0%.